FUZZY TRANSSHIPMENT PROBLEM WITH TRANSIT POINTS
نویسندگان
چکیده
منابع مشابه
Max – Min Method to Solve Fuzzy Transshipment Problem
This paper deals with fuzzy transshipment problem in which available commodity frequently moves from one source to another source before reaching its actual destination. Here Max – Min method is introduced to find initial feasible solution for the large scale fuzzy transshipment problem. Mathematics Subject Classification: 03E72
متن کاملAn Algorithm to Solve Fuzzy Trapezoidal Transshipment Problem
The fuzzy transportation problem in which available commodity frequently moves from one source to another source or destination before reaching its actual destination is called a fuzzy transshipment problem. In this paper, a new method is proposed to find the fuzzy optimal solution of fuzzy transportation problems with the following transshipment: From a source to any another source, from a des...
متن کاملAn Inapproximability of Transshipment Problems with Permutable Transit Vectors
We investigate the hardness of approximating a transshipment problem with a permutable transit vector. We have already known that the transshipment problem of minimizing the total shipping cost is NP-hard. In this paper, we prove that even if the unit shipping cost associated with every arc is given as a positive integer, there is no polynomial time constant factor approximation algorithm for t...
متن کاملThe multilocation transshipment problem
We consider a supply chain, which consists of several retailers and one supplier. The retailers, who possibly differ in their cost and demand parameters, may be coordinated through replenishment strategies and transshipments, that is, movement of a product among the locations at the same echelon level. We prove that in order to minimize the expected long-run average cost for this system, an opt...
متن کاملThe Quickest Transshipment Problem
A dynamic network consists of a graph with capacities and transit times on its edges. The quickest transshipment problem is defined by a dynamic network with several sources and sinks; each source has a specified supply and each sink has a specified demand. The problem is to send exactly the right amount of flow out of each source and into each sink in the minimum overall time. Variations of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Pure and Apllied Mathematics
سال: 2016
ISSN: 1311-8080,1314-3395
DOI: 10.12732/ijpam.v107i4.22